Possible World Semantics for First Order LP
نویسنده
چکیده
In the tech report [3] an elegant formulation of the first-order logic of proofs was given, FOLP. This logic plays a fundamental role in providing an arithmetic semantics for first-order intuitionistic logic, as was shown. In particular, the tech report proved an arithmetic completeness theorem, and a realization theorem for the FOLP. In this paper we provide a possible-world semantics for FOLP, based on the propositional semantics of [4]. We also give an Mkrtychev semantics. Motivation and intuition for FOLP can be found in [3], and are not discussed here.
منابع مشابه
TR-2011010: Possible World Semantics for First Order LP
In [1] an elegant formulation of the first-order logic of proofs was given, FOLP. That report also proved an arithmetic completeness theorem, and a realization theorem for the logic. In this report we provide a possible-world semantics for FOLP, based on the propositional semantics of [2]. Motivation and intuition for the logic itself can be found in [1], and are not discussed here. We also giv...
متن کاملLP, Weak Constraints, and P-log
LP is a recently introduced formalism that extends answer set programs by adopting the log-linear weight scheme of Markov Logic. This paper investigates the relationships between LP and two other extensions of answer set programs: weak constraints to express a quantitative preference among answer sets, and P-log to incorporate probabilistic uncertainty. We present a translation of LP into progr...
متن کاملOn Correspondences between Probabilistic First-Order and Description Logics
This paper analyzes the probabilistic description logic PSHIQ by looking at it as a fragment of probabilistic first-order logic with semantics based on possible worlds. We argue that this is an appropriate way of investigating its properties and developing extensions. We show how the previously made arguments about different types of first-order probabilistic semantics apply to P-SHIQ. This app...
متن کاملFirst-Order Modal Logic Theorem Proving and Standard PROLOG
Many attempts have been started to combine logic programming and modal logics. Most of them however, do not use classical PROLOG, but extend the PROLOG idea in order to cope with modal logic formulae directly. These approaches have the disadvantage that for each logic new logic programming systems are to be developed and the knowledge and experience gathered from PROLOG can hardly be utilized. ...
متن کاملIntensional First-Order Logic for P2P Database Systems
The meaning of concepts and views defined over a database ontology can be considered as intensional objects which have a particular extension in a given possible world: for instance in the actual world. Thus, non invasive mapping between completely independent peer databases in a P2P systems can be naturally specified by the set of couples of views, which have the same meaning (intension), over...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011